AG codes and AG quantum codes from the GGS curve
نویسندگان
چکیده
In this paper, algebraic-geometric (AG) codes associated with the GGS maximal curve are investigated. The Weierstrass semigroup at all Fq2-rational points of the curve is determined; the Feng-Rao designed minimum distance is computed for infinite families of such codes, as well as the automorphism group. As a result, some linear codes with better relative parameters with respect to one-point Hermitian codes are discovered. Classes of quantum and convolutional codes are provided relying on the constructed AG codes.
منابع مشابه
Multi-point Codes from the GGS Curves
This paper is concerned with the construction of algebraic geometric codes defined from GGS curves. It is of significant use to describe bases for the Riemann-Roch spaces associated to some totally ramified places, which enables us to study multi-point AG codes. Along this line, we characterize explicitly the Weierstrass semigroups and pure gaps by an exhaustive computation of the basis for Rie...
متن کاملTwo-Point Codes for the Generalized GK curve
In this article we investigate AG codes constructed using the generalized GiuliettiKorchmaros curve. More precisely we consider two-point codes coming from this curve. A special case was considered in [5], where two-point codes coming from the Giulietti-Korchmaros curve were studied. However, even in this special case, our results improve upon what is currently known. Our method builds on the o...
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملMagma Implementation of Decoding Algorithms for General Algebraic Geometry Codes
Goppa’s codes on algebraic curves defined over finite fields, called AG codes, are usually regarded as the most successful class of error correcting codes in theory as well as in practice. The class of AG codes provides series of constructible codes with large minimum distance that surpasses the Gilbert-Varshamov bound. Through the 80’s and 90’s, researchers devised efficient decoding algorithm...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1703.03178 شماره
صفحات -
تاریخ انتشار 2017